منابع مشابه
Block Line Cut Vertex Digraphs of Digraphs
In this paper, the digraph valued function(digraph operator), namely the block line cut vertex digraph BLC(D) of a digraph D is defined, and the problem of reconstructing a digraph from its block line cut vertex digraph is presented. Outer planarity, maximal outer planarity, and minimally non-outer planarity properties of these digraphs are discussed.
متن کاملOn Pathos Adjacency Cut Vertex Jump Graph of a Tree
In this paper the concept of pathos adjacency cut vertex jump graph PJC(T ) of a tree T is introduced. We also present a characterization of graphs whose pathos adjacency cut vertex jump graphs are planar, outerplanar, minimally non-outerplanar, Eulerian and Hamiltonian.
متن کاملShortest Cut Graph of a Surface with Prescribed Vertex Set
We describe a simple greedy algorithm whose input is a set P of vertices on a combinatorial surface S without boundary and that computes a shortest cut graph of S with vertex set P . (A cut graph is an embedded graph whose removal leaves a single topological disk.) If S has genus g and complexity n, the running-time is O(n log n+(g + |P |)n). This is an extension of an algorithm by Erickson and...
متن کاملEdge-coloring Vertex-weightings of Graphs
Let $G=(V(G),E(G))$ be a simple, finite and undirected graph of order $n$. A $k$-vertex weightings of a graph $G$ is a mapping $w: V(G) to {1, ldots, k}$. A $k$-vertex weighting induces an edge labeling $f_w: E(G) to N$ such that $f_w(uv)=w(u)+w(v)$. Such a labeling is called an {it edge-coloring k-vertex weightings} if $f_{w}(e)not= f_{w}(echr(chr(chr('39')39chr('39'))39chr(chr('39')39chr('39'...
متن کاملSBV-Cut: Vertex-cut based graph partitioning using structural balance vertices
Article history: Received 6 January 2011 Received in revised form 8 November 2011 Accepted 8 November 2011 Available online 21 November 2011 Graphs are used for modeling a large spectrum of data from the web, to social connections between individuals, to concept maps and ontologies. As the number and complexities of graph based applications increase, rendering these graphs more compact, easier ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: International Journal of Applied Mathematical Research
سال: 2012
ISSN: 2227-4324
DOI: 10.14419/ijamr.v1i4.204